Bisimulation on speed: worst-case efficiency
نویسندگان
چکیده
منابع مشابه
Worst-Case Efficiency Analysis of Queueing Disciplines
Consider n users vying for shares of a divisible good. Every user i wants as much of the good as possible but has diminishing returns, meaning that its utility Ui(xi) for xi ≥ 0 units of the good is a nonnegative, nondecreasing, continuously differentiable concave function of xi. The good can be produced in any amount, but producing X = ∑n i=1 xi units of it incurs a cost C(X) for a given nonde...
متن کاملBisimulation on Speed: A Unified Approach
Two process–algebraic approaches have been developed for comparing two bisimulation–equivalent processes with respect to speed: the one of Moller/Tofts equips actions with lower time bounds, while the other by Lüttgen/Vogler considers upper time bounds instead. This paper sheds new light onto both approaches by testifying to their close relationship and brings the research into bisimulation–bas...
متن کاملBisimulation on Speed: Lower Time Bounds
More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation– based faster–than preorder, the MT–preorder, which have not been addressed since. The encountered difficulties concern a general compo...
متن کاملA Framework for the Evaluation of Worst-Case System Efficiency
In this paper we present FASE (Fast Asynchronous Systems Evaluation), a tool for evaluating worst-case efficiency of asynchronous systems. This tool implements some well-established results in the setting of a timed CCS-like process algebra: PAFAS (a Process Algebra for Faster Asynchronous Systems). Moreover, we discuss some new solutions that are useful to improve the applicability of FASE to ...
متن کاملOn the Efficiency of Deciding Probabilistic Automata Weak Bisimulation
Weak probabilistic bisimulation on probabilistic automata can be decided by an algorithm that needs to check a polynomial number of linear programming problems encoding weak transitions. It is hence polynomial, but not guaranteed to be strongly polynomial. In this paper we show that for polynomial rational probabilistic automata strong polynomial complexity can be ensured. We further discuss co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2004
ISSN: 0890-5401
DOI: 10.1016/j.ic.2002.08.001